Distributed Key Management in Wireless Mesh Networks based on Verifiable Secret Sharing

نویسندگان

  • Peng Xiao
  • Jingsha He
  • Yingfang Fu
چکیده

Wireless mesh networks (WMNs) are wireless access networks based on IP technologies, which combine the advantages of WLANs and ad hoc networks and have thus become broadband access networks with high capacity, high speed and wide coverage. Due to the multi-hop characteristics of WMNs, security has become a critical issue in WMNs and a simple and effective distributed key management is essential for the development of secure WMNs. In this paper, we propose a distributed key management scheme in WMNs by combing several key technologies, such as ECC, (t, n) threshold cryptography, verifiable secret sharing, etc. Based on a zone-based hierarchical model, our proposed key management scheme is comprised of two parts: group key management in the backbone network and session key establishment in the zone networks. We also show the security and the effectiveness of the proposed scheme through analysis and simulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Group Key Management in Wireless Mesh Networks

Combining the advantages of WLANs and ad hoc networks, wireless mesh networks (WMNs) are wireless access networks based on IP technologies and have become effective broadband access networks with high capacity, high speed and wide coverage. Security is a crucial and urgent problem in WMNs as in other types of networks and a simple and effective distributed key management is essential for the es...

متن کامل

Design of certification authority using secret redistribution and multicast routing in wireless mesh networks

Wireless mesh networks (WMNs) should provide authentication and key management without a trusted third party because of their self-organizing and self-configuring characteristics. Several solutions to this problem have been proposed in mobile ad hoc networks (MANETs). But they are not optimal for WMNs because WMNs are with stationary mesh routers (MRs) that do not suffer from the limited power ...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012